Methods, computer systems, and computer readable media for controlling the status of network address space

ABSTRACT

Methods, computer systems, and computer readable media provide for automated control of the status of network address space. Blocks of networking address space assigned to a network may be allocated from a free status to a new status based upon a request to allocate a particular size block. Blocks of networking address space assigned to a network that have been allocated to a new status may be deallocated to return to a free status based upon a request to deallocate the chosen block. Blocks of networking address space assigned to a network that have been allocated and otherwise manipulated such as through a lend from another network may be reclaimed for the original network upon a request to reclaim the chosen block.

TECHNICAL FIELD

The present invention is related to the administration of networkaddress space. More particularly, the present invention relates tocontrolling the status of blocks of network address space.

BACKGROUND

Networking addresses serve to identify devices and/or locations on anetwork and may include various classes of information, includingtelephone numbers, medium access control values corresponding to layer 2of the communications protocol stack, Internet Protocol (“IP”) addressescorresponding to layer 3 of the communications protocol stack,Autonomous System Numbers (“ASN”) corresponding to layer 4 of thecommunications protocol stack, serial numbers, and others. Furthermore,each of the classes of networking addresses may have variations. Forexample, IP addresses may be of different varieties such as InternetProtocol version 4 (“IPv4”) and Internet Protocol version 6 (“IPv6”).

Networking addresses such as these must be maintained by an organizationand managed appropriately. Such management must insure that no twodevices, and/or locations depending upon the class of network addresses,are assigned the same networking address in a common routing area of anetwork. Additionally, these addresses must be managed appropriately sothat networking addresses are assigned to maximize routing tableefficiency. Furthermore, because networking addresses are limitedcommodities, if the available addresses are not appropriately managed,then addresses may be wasted by being unused while a need exists forthose addresses. Thus, address uniqueness and appropriate distributionare important factors in network performance.

Conventionally, networking addresses are managed through the manual useof a text listing or a spreadsheet. The spreadsheet may consist of acolumn of networking addresses or blocks of addresses, with additionalcolumns containing attributes of each address or block of addresses. Theinformation in the cells of the text listing or spreadsheet is updatedwhen the set of managed addresses or the attributes of the addresseshave changed. Accordingly, the network administrator must study thespreadsheet to find out the attribute value(s) for a particularnetworking address or block of addresses. For example, a particularsheet of a spreadsheet may represent a particular network so that thenetworking addresses on this particular sheet are those designated forthat network. Furthermore, one or more columns within a sheet mayrepresent the status of the address block while another columnrepresents the associated network equipment for allocated addresses.

The conventional method of manually tracking network addresses in aspreadsheet provides the administrator with no management tools otherthan the raw information within the spreadsheet cells. A text listing orspreadsheet may display at most a few hundred data elements in a conciseformat, whereas an administrator may be responsible for millions ofaddresses. Furthermore, views of the data are limited to the originalorganization of the data, for example, in order of address, whichrequires manual searches or additional utilities to access theinformation by another perspective, i.e. addresses of a particularstatus. For address formats such as IP that use classless interdomainrouting (“CIDR”) based numbering, addresses may be administered inblocks of very specific sizes and boundaries. These limits are notobvious in the conventional spreadsheet method except perhaps to thoseadministrators with a thorough familiarity with the address format,which makes the administration of the addresses more difficult.

The administration of networking address space may require variousactions. For example, a portion of space assigned to one network andinitially given a free status may later be needed for allocation to adifferent status, such as being given a connected status for use withparticular network connections of devices. As another example, a portionof space that already has been allocated to a particular status may needto be deallocated to return to the pool of free space for the assignednetwork so that it can later be re-allocated. Additionally, a portion ofspace that has been allocated may need to be reclaimed, such as wherethe portion has been transferred to another network during a lend ofaddress space.

The lack of an automated process for controlling the status of portionsof the network addressing space creates many problems for theadministrator. For manual tasks of administrating the networking addressspace, there is room for clerical errors as well as errors in judgmenteach time a manual activity is done. The administrator may experiencedifficulties in each of the activities required to administer thenetworking address space including allocation, deallocation, andreclaim.

For allocation, an example of a problem the administrator may face isdifficulty in finding available blocks of particular sizes that may beavailable for allocation to a needed status for a given network. Themanual task of dividing up blocks to allocate as needed often leads tothe inefficient distribution of address space due to difficulty inmanually judging the size and location of the block to allocate.

Additionally, there are issues associated with deallocating blocks thathave been previously allocated to a particular status. The blocks mustbe manually located within the spreadsheet to change their status asappropriate. Furthermore, coalescing of newly deallocated blocks withadjacent free blocks may be overlooked during the manual process. Thefailure to coalesce smaller blocks into fewer larger ones leads tounnecessary complexity within the representation of the network space.Furthermore, it may be desirable to delay the availability ofdeallocated blocks for re-use. Addresses persist in the memory ofnetwork equipment after the addresses have been deactivated.Reactivation of the addresses before expiration of the old informationmay cause routing problems. This delay may be overlooked in the manualprocess. Additionally, these blocks to be deallocated may be needed fora previously initiated reclaim action such that their deallocationshould be suspended, but the manual deallocation may overlook thepreviously initiated reclaim.

In addition to the issue noted above for deallocation, reclaims presentseveral other difficulties for administrators. For example, reclaims mayrequire that address space be placed into a reserved status until areclaim action can be completed. Reclaiming large blocks of addressspace requires preventing re-use of smaller blocks that make up thelarger blocks to be reclaimed, and keeping track of those blocks thatare reserved so as to later form a large block to be reclaimed is a verydifficult task to complete manually.

SUMMARY

Embodiments of the present invention address these issues and others byproviding methods, computer systems, and computer readable media thatautomate the control of the status of networking address space.Accordingly, the administrator may more easily assign one status oranother to portions of the networking address space. The administratormay control the status by providing basic information to the automatedcontrol to complete a status change within a definitional listing forthe networking address space. For example, the administrator may providea size of a block to allocate for a particular network or provide theblock to deallocate or reclaim for a particular network.

Embodiments such as computer-implemented methods, computer systems, andcomputer readable media change a status of a portion of network addressspace from free to another status. These embodiments involve receiving arequest of a block size to allocate for a current network with a newstatus. It is detected within a definitional listing for the networkaddress space a block with free status of sufficient size to cover theblock size to allocate. For the current network, the new status isassigned to the detected block within the definitional listing.Furthermore, the selection of a block may involve relocation of addressspace from another network.

Other embodiments change a status of a portion of network address spacefrom a first status to a free status. These embodiments involvereceiving a request of a block to deallocate for a current network tothe free status. For the current network, the free status is assigned tothe requested block within a definitional listing for the networkaddress space.

Still other embodiments change a status of a portion of network addressspace from a first status to a status of a reclaim. These embodimentsinvolve receiving a reclaim action request for a block of a currentnetwork. It is detected whether the entire block to reclaim is in areclaim pending status. When the entire block to reclaim is in thereclaim pending status, the reclaim action is performed upon the entireblock within a definitional listing for the network address space.

DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a typical operating environment for embodiments of thepresent invention including a typical architecture of a computer wheredisplays of network space may be provided.

FIG. 2 shows an illustrative definitional listing for networking addressspace of an embodiment, including the definition of blocks for networksand associated status and parameters.

FIG. 2A shows an illustrative definitional listing for networkingaddress space including utilization and aggregation values computed whenrating blocks.

FIG. 3 shows an operational flow of an embodiment for allocating addressspace by finding a block of the appropriate size and assigning a newstatus to it.

FIG. 4 shows an operational flow of an embodiment for lending networkingaddress space from one network to another, as used in the operationalflow of FIG. 3 when attempting to allocate networking address space.

FIG. 5 shows an operational flow of an embodiment for finding a freeblock as used in the operational flow of FIG. 3 when attempting toallocate networking address space.

FIG. 6 shows an operational flow of an embodiment for selecting a blockto allocate using a next block option as used in the operational flow ofFIG. 3 when attempting to allocate the networking address space.

FIG. 7 shows an operational flow of an embodiment for selecting a blockto allocate using a utilization fit option as used in the operationalflow of FIG. 3 when attempting to allocate the networking address space.

FIG. 8 shows an operational flow of an embodiment for selecting a blockto allocate using a rated fit option as used in the operational flow ofFIG. 3 when attempting to allocate the networking address space.

FIG. 9 shows an operational flow of an embodiment for rating a blockwhen attempting to allocate using the rated fit option as used in theoperational flow of FIG. 8.

FIG. 10 shows an operational flow of an embodiment for deallocatingnetworking address space to a free status.

FIG. 11 shows an operational flow of an embodiment for reclaimingnetworking address space according to a requested reclaiming action.

FIG. 12 shows a screenshot where a user is selecting a device to add.

FIG. 13 shows a screenshot where a user is selecting a network to addthe device to.

FIG. 14 shows a screenshot where a user is selecting a connection forthe device being added.

FIG. 15 shows a screenshot where the address block for the new device isshown.

FIG. 16 shows a screenshot where the user is creating a new connectionfor the device being added.

FIG. 17 shows a screenshot where the newly allocated address block forthe new device is shown.

FIG. 18 shows a screenshot where the new connection and correspondingnewly allocated address block for the new device is shown.

FIG. 19 shows a screenshot where a summary of a connection is shown uponselection by a user.

FIG. 20 shows a screenshot where a map of address space reflects theallocation of an address block for the newly added device.

FIG. 21 shows a screenshot where a map of address space reflects that ablock of address space is undefined after a lend operation moved thespace to another network.

FIG. 22 shows a screenshot where a user is adding a new range ofallocated space.

FIG. 23 shows a screenshot where a user is viewing the parameters of anetwork.

FIG. 24 shows a screenshot where a user is selecting an allocation typeand order for a network.

FIG. 25 shows a screenshot where a user is selecting a minimum lendinglimit for a network.

FIG. 26 shows a screenshot where a user is selecting a maximum lendinglimit for a network.

FIG. 27 shows a screenshot where a user is deleting an address range todeallocate the range.

FIG. 28 shows a screenshot where the deallocated address block is shownwith a free status.

FIG. 29 shows a screenshot where the address block being deallocatedcurrently is given a re-use delay interval status.

FIG. 30 shows a screenshot where a user is initiating a reclaim action.

FIG. 31 shows a screenshot where a user has successfully requested thatan address range be added to allocate the space.

FIG. 32 shows a screenshot where a user may adjust rated fit parametersused when rating blocks for a find operation.

FIG. 32A shows a screenshot where a user it utilizing a wizard to setthe rated fit parameters.

FIG. 33 shows a screenshot where a user may add a device to a network byselecting a device template and then may also manipulate the parametersof the device defined by the template.

FIG. 34 shows a screenshot where the result of successfully creating adevice is shown but is prior to allocating any address space of anetwork for the device.

FIG. 35 shows a screenshot where a user may add the device that has beencreated to the chosen network which may involve selection of anavailable connection or creation of a new connection.

DETAILED DESCRIPTION

Embodiments of the present invention provide automated control of thestatus of networking address space to allow administrators to manage thenetworking address space without manually performing the status control.This automated control of the status of the networking address space mayprovide for various automated functions such as allocating free space toa new status, deallocating space having a particular status to free, andreclaiming space whose status has been previously manipulated such as tomove the space to a new network.

The embodiments of the present invention are implemented in a computersetting. A standalone computer may implement embodiments of the presentinvention. Alternatively, embodiments of the present invention may beimplemented on a networked basis where resources are distributed overthe network and are accessed through the network as necessary. A typicaloperating environment for both the standalone implementation and thenetwork-based implementation are shown in FIG. 1.

FIG. 1 and the following discussion are intended to provide a brief,general description of a suitable computer system environment in whichthe invention may be implemented. While the invention will be describedin the general context of program modules that execute in conjunctionwith application programs that run on an operating system on a personalcomputer, those skilled in the art will recognize that the invention mayalso be implemented in combination with other program modules.Generally, program modules include routines, programs, components, datastructures, and other types of structures that perform particular tasksor implement particular abstract data types.

Moreover, those skilled in the art will appreciate that the inventionmay be practiced with other computer system configurations, includinghand-held devices, multiprocessor systems, microprocessor-based orprogrammable consumer electronics, minicomputers, mainframe computers,and the like. The invention as applied to the personal computer of FIG.1 may also be practiced in distributed computing environments wheretasks are performed by remote processing devices that are linked througha communications network. In a distributed computing environment,program modules may be located in both local and remote memory storagedevices.

FIG. 1 shows an illustrative computer architecture for a personalcomputer 100 for practicing the various embodiments of the invention.The computer architecture shown in FIG. 1 illustrates a conventionalpersonal computer, including a central processing unit 102 (“CPU”), asystem memory 104, including a random access memory 106 (“RAM”) and aread-only memory (“ROM”) 108, and a system bus 120 that couples thememory to the CPU 102. A basic input/output system containing the basicroutines that help to transfer information between elements within thecomputer, such as during startup, is stored in the ROM 108.

The personal computer 100 further includes a mass storage device 110 forstoring an operating system 112 and application programs. Theapplication programs may include a browser 114 such as a conventionalweb browser or other dedicated program that may be used to providedisplays of networking address space, such as the displays discussed incommonly owned and co-pending U.S. patent application Ser. No.10/642,475 entitled METHODS, COMPUTER SYSTEMS, AND COMPUTER READABLEMEDIA FOR GENERATING DISPLAYS OF NETWORKING ADDRESSES which isincorporated herein by reference. The application programs may alsoinclude a manager application 116 that the browser 114 may operate upon,or that may function independently to render the displays of networkingaddress space and/or to provide the automated control of the status ofnetworking address space. The mass storage device 110 may also storedefinitional listings of network space usage described below in moredetail with reference to FIG. 2 that are utilized by the managerapplication 116 when performing the control of status of the addressspace.

The mass storage device 110 is connected to the CPU 102 through a massstorage controller (not shown) connected to the bus 120. The massstorage device 110 and its associated computer-readable media, providenon-volatile storage for the personal computer 100. Although thedescription of computer-readable media contained herein refers to a massstorage device, such as a hard disk or CD-ROM drive, it should beappreciated by those skilled in the art that computer-readable media canbe any available media that can be accessed by the personal computer100.

By way of example, and not limitation, computer-readable media maycomprise computer storage media and communication media. Computerstorage media include volatile and non-volatile, removable andnon-removable media implemented in any method or technology for storageof information such as computer-readable instructions, data structures,program modules or other data. Computer storage media includes, but isnot limited to, RAM, ROM, EPROM, EEPROM, flash memory or other solidstate memory technology, CD-ROM, DVD, or other optical storage, magneticcassettes, magnetic tape, magnetic disk storage or other magneticstorage devices, or any other medium which can be used to store thedesired information and which can be accessed by the computer.

Communication media typically embody computer-readable instructions,data structures, program modules or other data in a modulated datasignal such as a carrier wave or other transport mechanism and includesany information delivery media. The term “modulated data signal” means asignal that has one or more of its characteristics set or changed insuch a manner as to encode information in the signal. By way of example,and not limitation, communication media include wired media such as awired network or direct-wired connection, and wireless media such asacoustic, RF, infrared, and other wireless media. Combinations of any ofthe above should also be included within the scope of computer-readablemedia. Computer-readable media may also be referred to as computerprogram product.

The personal computer 100 of FIG. 1 may also include input/outputcontroller interfaces 124 for receiving and processing input from anumber of devices, including a keyboard or mouse (not shown). Similarly,the input/output controller interfaces 124 may provide output to adisplay screen 126, a printer, or other type of output device. Suchoutput may include a display of input fields and graphical userinterface controls for receiving user input to initiate a change ofstatus to the networking address space according to logical operationsperformed by the management application 116 and discussed below withreference to FIGS. 3-11.

As mentioned briefly above, a number of program modules and data filesmay be stored in the mass storage device 110 and RAM 106 of the personalcomputer 100, including an operating system 112 suitable for controllingthe operation of a stand-alone personal computer. The mass storagedevice 110 and RAM 106 may also store one or more application programssuch as the browser 114 as well as the manager application 116 thatprovides the control of status for the networking address space.Embodiments of the present invention provide program modules for use inconjunction with the manager program 116. The program modules mayimplement logical operations such as those of FIGS. 3-11 to control thestatus of the networking address space. The manager program 116 mayutilize additional program modules as well such as to create visualdisplays of networking address space as discussed above.

As an alternative to providing the manager application 116 and relateddefinitional listings 118 on the mass storage device 110 of the computer100, these resources may be located on a communications network 128 suchas the Internet as mentioned above. The computer 100 may include anetwork interface 122 linked to the CPU 102 through the bus 120, and thenetwork interface 122 permits data communications to occur betweenprograms being performed by the CPU 102, such as the browser 114, andthe resources on the network 128. For example, the network interface 122may utilize Ethernet protocol to communicate with a communicationsgateway of the network 128.

The resources necessary to control the status of the networking addressspace through use of the computer 100 may be located on a computerserver 130 also in communication with the network 128. Accordingly, thecomputer 100 may access the resources of the server 130 over the networksuch as to access application programs and data maintained by the server130. The server 130 runs an operating system 132 which allows the server130 to communicate with the network 128 to provide access to a managerapplication 134 stored by the server 130. This manager application 134can be run by the browser 114 of the computer 100. Furthermore, theserver 130 may store the definitional listings 136 for the networkingaddress space that may be accessed as necessary by the managerapplication 134.

While the embodiments above refer to the manager application 116 and/ormanager application 134 as being operated upon by a browser 114, it willbe appreciated that these application programs may instead beimplemented as independently operable computer programs that do not relyupon functionality of a browser. The particular implementation is adesign choice. However, utilizing the functionality of a browser allowsthe manager application program to be operable across a variety ofcomputer platforms without requiring a different manager applicationprogram for each platform.

The computer 100 or computer 130 may be an administrative computer thatissues the networking address to devices of the network throughoperation of the manager application. Once issued, routers referencerouting tables mapping connections to networking addresses to deliverpackets to the device with a particular networking address and receivepackets sent by the device to direct them to their destination. Suchdevices may be present on a global network 128 but are confined tosubordinate networks such as local area networks (“LAN”) where a portionof the networking address identifies the subordinate network and aremaining portion identifies the device on the subordinate network.These devices 1-N of one or more subordinate networks are showngenerally in FIG. 1 as device set 138.

Network address space may be administered from a single set ofaddresses, however, dividing the set of defined address space aids thenetwork administrator in managing the distribution of addresses withregard to address utilization and route aggregation, supporting multipleaddress types, as well as controlling administrative access to theaddresses. This is accomplished by dividing the address space intomultiple sets, each associated with a distinct network which hasattributes controlling the management of the contained space. Advancedfunctions of the allocation process use network configuration andrelationships between networks, which are arranged in a linked structuresuch as a tree. FIG. 2 shows an illustrative table representative of adefinitional listing for a set of networks of a corporation using IPv4.The definitional listing may include networks with other types, or a mixof networks of different types.

Associating address space with networks also supports the existence ofdistinct instances of address space. Transferring address space betweennetworks and calculating aggregate address blocks are functions to beperformed on a single instance of network address space. A network isconsidered to aggregate, or share space, with its parent network if itis configured to aggregate and it supports the same address type (i.e.IPv4) as its parent. A network is also considered to aggregate with anancestor network if it aggregates with its parent and the parentaggregates with the ancestor. Any two networks are considered toaggregate if they aggregate with a common ancestor. Advanced functionsof lending and rated fit block selection, discussed below with referenceto FIGS. 4 and 8, respectively, limit their scope to within a set ofaggregate networks.

The listing of FIG. 2 includes several categories of information. Thecategories include: a network name, an ID for the network, an ID of theparent of the network if any, an address type, an allocation type andorder, whether the network aggregates, lending limits for the network, are-use interval for the network, a description of the network, addressblocks assigned to the network, and a status of each address block. Eachof these categories of information is discussed in greater detail belowin relation to the operational flow shown in FIGS. 3-11. For purposes ofillustration, the network category of the table of FIG. 2 includes thetree structure and related icons reflected in the screenshots of FIGS.12-31 and 33-35, discussed below in greater detail, to demonstrate therelationship of each entry of the tree to the set of information that isassociated with each entry.

In an IP network, two interfaces are directly connected in the IP layeronly if their addresses belong to the same IP network segment asdetermined by their respective addresses and masks. Insuring networkconnectivity requires the allocation of individual addresses from thesame block for all mutually connected addresses. A connection is anaddress block that has been allocated to represent a network segmentwith multiple attached interfaces.

Creation of the first interface on a network segment requires theallocation of a block of address space for the connection. The entireblock is designated as belonging to the connection so that it cannot bedivided or transferred to another purpose. The allocated block must beof sufficient size to support the number of interfaces that willultimately be connected to the segment. A single address is assignedfrom the available addresses within the connection block. This addressalong with the mask of the entire connection block comprises theinterface address. Subsequent allocation of interfaces on an existingsegment requires identifying the existing connection block. Anotheraddress from within the connection block is assigned to the interfacealong with the mask of the entire connection block. In each case, thestatus of the address within the connection block is changed to indicatethe individual address is in use.

Connection blocks may not be further divided for transfer to anothernetwork. Therefore, selection of addresses within a connection block isnot subject to lending as discussed below with reference to FIGS. 3 and4. In addition, addresses within the block will not aggregate withdescendant networks, so the aggregate processing of rated fit selectionis unnecessary, as discussed below with reference to FIG. 8.

Devices define sets of associated addresses that comprise a structuredview of a physical or logical network. Devices provide links betweentheir attached networks, regardless of the relationship between thosenetworks. They may link networks from distinct instances of IP space,for example public and private networks, and between networks ofdifferent address types, including but not limited to IPv4 and IPv6.

Device templates assist the user in creating an appropriate set ofinterfaces and allocations. A template predefines a set of interfacesand configuration data appropriate for a selected hardware type of aparticular application of the type. It may be used to restrict thenumber and type of interfaces, follow naming conventions, requestspecific descriptive information, or control the type of addresses thatmay be applied to specific interfaces.

As discussed above in relation to FIG. 1, the manager application mayprovide various functions including the controlling the status of thevarious blocks of network address space being managed. One function isan allocation function whereby a block becomes allocated by its statusas a free block being changed to a new allocated status. This allocationfunction is represented in FIG. 3. The allocation functions begin atfree block operation 300 upon the user providing a request to allocate afree block such as for a device connection discussed above. The userprovides information to initiate allocation of a free block by addingdevices to the network and creating a connection for the device.

FIG. 12 shows an illustrative screenshot 1200 of a manager applicationwhere the user is attempting to add a device which gives rise to theallocation operations of FIG. 3.

The current network is “Atl office” 1202 as highlighted in the tree. Theuser has selected “devices” button 1208 which displays the deviceoptions. The user has also then selected the “add” button 1204 whichdisplays the menu of devices that the user may add to the network. Inthis example, the user selects the Acme single port device, referencinga template with predefined configuration details for that device type.Device templates assist the user with accurate address allocation byspecifying an appropriate number of interfaces and the allowed addressoptions for the device, for example support of single-bit addresseswhich will be discussed further.

FIG. 13 shows an illustrative screenshot 1300 where the user iscompleting the addition of the device to the network by providingadditional information for the manager application. The user specifiesthe name 1302 and other details as desired such as a more detaileddescription for the device. The interface name for the device may beprovided and may be altered as desired by the user, along with a moredetailed description for the interface. The user may select theconnection source from a drop down menu of the networks. In thisexample, the user has selected the “Atl office” as the connection sourcefor the single port device being added to the “Atl office” network.

FIG. 14 shows an illustrative screenshot 1400 where the user hasselected the connection source and must now select the connection forthe single port device. A drop down menu 1402 is provided to allow theuser to select between an existing connection that is available for thedevice or to opt to create a new connection. In this example, the userselects the existing connection that is available. The overall status ofthe block is not changed because the block is allocated to theconnection as a unit. However, this action selects a single address thatis available within the connection and changes its status to indicateits assignment to the device interface. Therefore, in this example, theallocation operations of FIG. 3 might not be fully utilized. Theselection of an address is limited to selecting a single address fromthe available addresses within the connection block. FIG. 15 provides ascreenshot 1500 that shows that the new device connection is assigned tothe address block 1502 for the chosen connection.

An alternative method of tracking the connection block is to mark eachblock within the connection separately, using an “available” status forthose addresses within the connection but not allocated to an interface.In this case the allocation action will change the status of theindividual address but not affect the other addresses within the block.

However, FIG. 16 provides an illustrative screenshot 1600 where the useropts to create a new connection from the drop down menu 1602. The userprovides a name in field 1604 for the new connection and at option 1606selects either to have a point-to-point connection or a pool connection.A point-to-point connection contains only two usable addresses, where apool connection contains more. IP addresses in particular reserve thefirst and last address from each block for a special purpose. A block offour addresses is used for a point-to-point connection, where twoaddresses are reserved and the remaining two are available for use.Block details 1902 in FIG. 19 show an example of address reservation ina /30 block. Pool addresses are available as any larger size block ofthe form 2^(n), where 2 addresses are reserved and 2^(n)-2 are availableand are used to support multiple access network segments, such as LANs.Additionally, at option 1608, the user selects whether to use a /31addressing, which may only be used if a device supports /31 networkaddressing. In IPv4, /31 represents a block of two addresses which wouldnormally both be reserved. These devices may be configured to ignore thereserved addresses in blocks of size two and interpret them both asusable addresses.

FIG. 33 provides an illustrative screenshot 3300 of an alternateapplication in which the user is adding a device. The user has selecteda template group from menu 3302 to display the list of availabletemplates with descriptions. The user has then selected template 3304‘2620-1E2W’ to begin creating a device of type “2620” predefined withone Ethernet and 2 serial ports. The user enters descriptive informationfor the device in fields 3306. The user may increase the number ofinterfaces that will be defined in this instance of the device by makinga selection from drop down menu 3308. The options in this menu 3308, andtherefore the number of interfaces that may be created on this device,is controlled by the device template. The user may also delete thepredefined interfaces by selecting the delete buttons 3310. Theinterface names and descriptions may also be predefined in the templatesto provide consistent naming with external systems or hardwareconfigurations, allowing the allocated interface addresses to beaccurately mapped to live network hardware or external monitoringapplications. The grayed field 3312 indicates that interface name “E0”may not be changed, while fields 3314 with interfaces S0 and S1 areeditable.

FIG. 34 provides a screenshot 3400 that shows the result of thesuccessful creation of the device, before any addresses are allocatedfor it. Selecting button 3402 presents the user with allocation optionsas shown in screenshot 3500 of FIG. 35. In this screen, the user selectsthe source network for the allocation from network menu 3502. The userthen selects whether to use an existing connection or a new connectionthrough selector 3504. The “available” selector is disabled to indicatethere are no connections with available addresses in the selectednetwork. The options for defining a new connection are displayed in box3506. The user has selected a point-to-point connection. The “Use /31address” option 3508 is disabled because the template defined thisinterface on this device type to be unable to support this option.

Device templates may be further defined to restrict the addresses typesthat a device or specific interface may support. Through mapping of therepresented interface to live network equipment, a device template mayalso be defined to represent multiple logical interfaces per physicalinterface on a physical device.

Upon the user completing this information of FIG. 16 or FIG. 35, themanager application then begins the logical operations of FIG. 3 toallocate a free block of the “Atl office” network for the newconnection. The find free operation 300 attempts to find a block for thechosen network that is free and can be allocated for this newconnection. The details of the free block operation 300 are discussed inmore detail below with reference to FIG. 5.

As shown in FIG. 5, the free block operation 300 begins at queryoperation 500 which detects which allocation type has been specified forthe current network. The allocation type is originally specified whenthe network is added to the corporation, but the allocation type may bemodified by the user thereafter. FIGS. 23-26, discussed below, providescreenshots that show a network having its parameters such as allocationtype modified by a user. Thus, query operation 500 detects what thecurrent allocation type is for the network. Once the allocation type isdetected, the free address block is selected accordingly.

The allocation type may be one of several types. The allocation type maybe “next block” which selects the next block by numerical order ofaddress according to the allocation order configured for the network.When “next block” is the allocation type, the free block is chosen atnext block operation 510 which is described in more detail below withreference to FIG. 6.

The allocation type may be “utilization fit.” The utilization fitselects a block of the smallest available size that is of sufficientsize to satisfy the allocation request. Utilization fit may be fit highor fit low by numerical order of address. When utilization fit is theallocation type, the free block is chosen at utilization fit operation520 which is described in more detail below with reference to FIG. 7.

The allocation type may also be “rated fit.” Rated fit selects a blockwith the best rating derived from the block characteristics of size andaggregation with other blocks and is dependent upon the reason for theallocation. Rated fit may also be fit high or fit low. When rated fit isthe allocation type, the free block is chosen at rated fit operation 530which is described in more details below with reference to FIG. 8.

The allocation type may be of some other type as well, such as a typethat has been defined in an implementation enhanced with one or moreother allocation types. When this other type is selected, the free blockis chosen at fit operation 540 according to the rules defined for thisparticular allocation type.

Once the find operations have completed, query operation 550 of FIG. 5detects whether a block was successfully found. If not, then a fail isreturned by the free block operation 300 at fail operation 560. If afree block is successfully found, then the block is returned by the freeblock operation 300 at block operation 570.

Upon the free block operation 300 of FIG. 5 returning a block,operational flow proceeds to query operation 340 where it is determinedwhether the returned block is larger than the requested size. Therequested size may be determined by the size necessary to support a newconnection being requested by the user as discussed above with referenceto FIG. 16, or may have been explicitly set by the user by requestingthat space be selected from the network and be given an allocatedstatus.

FIG. 22 provides a screenshot 2200 that shows an example where a userrequests that a defined range of address space be selected from acurrent network and be given a specified status once the block of therequested size is found. This option allows the assignment of alternatestatuses to the block. The user selects the network 2202, the rangesbutton 2204 and then add button 2206 to reach the request page thatincludes the range size fields 2208 as well as the request type dropdown menu 2210. The range size fields 2208 allow the user to specify thesize of the range to add for the current network by entering a masksize, a netmask, or as another alternative not shown in FIG. 22, byentering the starting and ending addresses to use. Where the user entersthe size of the range by selecting a mask or a netmask, the user mayalso specify the minimum starting address and/or the maximum endingaddress to restrict the address of the range to be added.

Returning to query operation 340 of FIG. 3, if the block is not largerthan the requested size, then operational flow proceeds to statusoperation 360 where the status of the returned block is changed withinthe definitional listing to a new status. The status may be set to therequested status where additional processing may occur prior to settingthe status to be allocated. Such additional processing may includetransferring the block to another network, or updating additional tablesin the definitional listing with information about the allocation, forexample device and interface identification. Where no such additionalprocessing is required, the status may be set to “allocated,”“connection,” or some other status name representing that this block ofaddresses is no longer free but is or soon will be in use in thenetwork.

Where query operation 340 finds that the block is larger than therequested size, then split operation 350 splits the block in half andselects the upper or lower half according to the allocation ordercurrently set for the network within the definitional listing. Theremaining unselected half is returned to the network and keeps itsstatus as free. Query operation 340 then detects for the selected halfwhether it is larger than the requested size. If so, then operationalflow returns to split operation 350 where the selected half is split.This splitting continues until the selected half is no longer largerthan the requested size so that operational flow proceeds to statusoperation 360.

If this operation fails to return a block, under certain conditions theprocess may attempt to acquire additional address space from anothernetwork to satisfy the request through the lending process. Returning tofind free block operation 300, if this operation fails to return a blockbecause a free block for a specified range of the network, if a rangehas been specified, could not be found for the requested size, thenoperational flow proceeds to query operation 310. Query operation 310detects whether a block of the requested size exists for the currentnetwork regardless of the address range. If it does exist, then a failis returned at fail operation 330 and the failure notification to theuser may specify that the fail results from the specified range nothaving a satisfactory free block but that the network does contain asatisfactory free block outside of the specified range. This fail occursto prevent an unnecessary lend from occurring from another network whenthe current network has a free block that will satisfy the request ifthe range restriction is removed.

If the user has not specified a minimum and/or maximum to the range, asnoted above for FIG. 22, then query operation 310 is omitted andoperational flow proceeds directly to lend operation 320. Also, if queryoperation 310 is not omitted due to the user specifying a minimum and/ormaximum to the range and query operation 310 detects that the currentnetwork does not have a free block of at least the requested sizeregardless of the specified range, then operational flow proceeds tolend operation 320. Lend operation 320 is discussed in greater detailbelow with reference to FIG. 4. The lend operation 320 attempts to lendaddress space from an ancestor network (i.e., higher up the path in thetree structure) to a descendant network to satisfy the request forallocation of a block. If the lend fails, operational flow proceeds tofail operation 330 which returns a fail to the user. If the lendsucceeds, operational flow proceeds to query operation 340.

When an allocation according to the logical operations of FIG. 3succeeds, then the user may be provided with various visual indicationsof the successful allocation. As shown in the screenshot 1700 of FIG.17, an added device and interface is shown with the address 1702selected from the new connection block. The interface address is anindividual address while the mask gives the size of the associatedconnection block. For another example of requesting that address spacebe allocated by directly specifying the size and status, such as shownin FIG. 22, a successful indication of the allocation of address spaceis shown in the screenshot 3100 of FIG. 31.

Returning to the example of FIG. 17, upon completing the successfulallocation and display of the added device with the newly allocatedaddress block, the user may select to see the summary of devices asshown in the screenshot 1800 of FIG. 18. The list of devices 1806 nowincludes the new device while the list 1804 of address details for thecurrent network reflects the new connection for the device which isassigned to the newly allocated address block 1808 for the ownerconnection. As shown in the screenshot 1900 of FIG. 19, the arrow 1904beside each block of addresses for the current network may be selectedto display the details of that block in a list 1902 which sets forth theindividual addresses, their status, and any device details associatedwith an address. Address 1906 indicates the individual address assignedto the new device interface.

In the example shown, the block of addresses 192.168.122.16/30 allocatedfor the “Atl office” network was borrowed from the ancestor network“Merchant” using the lend operation 320. As shown in the screenshot 2000of FIG. 20, a map 2002 showing the address space for the selectednetwork 2004 shows the 192.168.122.16/30 block as allocated for the “Atloffice” network. Screenshot 2100 of FIG. 21 includes a map 2102 thatshows that particular block being undefined for “Merchant,” the selectednetwork 2104, since the lend operation 320 took the address space from“Merchant” network and provided it to the “Atl office” network.

The details of the lend operation 320 are shown in FIG. 4. Lending ispossible when there is a tree or other network structure. Alternately,the allocation process of FIG. 3 can happen in a flat environment, butlending will be left out, or will require some other means ofidentifying the lending network. The logical operations of the lendoperation 320 begin at query operation 400 where it is detected whetherthis network may attempt lending, whether the parent (i.e., immediateancestor) of the current network is compatible and whether the parentallows lending of the requested size. This determination is made byreferring to the definitional listing for the current network and theparent of the current network. To attempt lending, the current networkmust be configured to aggregate, meaning it may share the same instanceof address space as its parent. The ID of the parent network for thecurrent network is found from the listing for the current network andthen this ID is looked up to find the listing for the parent. The typecategory is then referenced to determine whether the type for the parentmatches the type for the child. For example, an IPv4 parent may lend toan IPv4 child, but not to an IPv6 child or an ASN child. Also, thelending limits category for the parent is referenced to determinewhether the maximum limit, if lending is allowed, is set to at least aslarge as the size of the requested block. If the aggregation setting forthe current network is no, the type is not a match or the lending sizeis not adequate, then the lending operation returns a fail.

Where query operation 400 finds that the parent is compatible and thelending limits of the parent are adequate, then operational flowproceeds to adjustment operation 410 where the requested size isadjusted so that it is at least as large as the minimum lending limitset for the parent. The minimum lending limit tends to prevent excessivefragmentation of address space in ancestor networks. Then, free blockoperation 420 attempts to find a free block in the parent network thatmeets the requested size. Free block operation 420 proceeds according tothe logical operations of FIG. 5 discussed above, where finding a freeblock is done according to the allocation type and order defined for theparent network in the definitional listing. When free block operation420 succeeds, operational flow proceeds to split operation 450.

Where free block operation 420 fails to find a satisfactory free blockof at least the adjusted size and within the specified range, if any,then query operation 430 detects whether a free block of the adjustedsize exists within the parent network regardless of the specified range.If a free block of sufficient size does exist within the parent, thenthe lend operation returns a fail. However, if the parent network doesnot have a free block sufficient size regardless of specified range,then operational flow proceeds to lend operation 440. Also, where norange is specified in the allocation request, then operational flowproceeds directly to lend operation 440 once free block operation 420has failed.

Lend operation 440 attempts to lend address space from the parentnetwork of the parent. Lend operation 440 proceeds according to thelogical operations of FIG. 4 beginning at query operation 400. When lendoperation 400 fails, a fail is returned to the user. However, when lendoperation 400 succeeds, operational flow proceeds to split operation450.

Split operation 450 repetitively splits the block in half and keeps onehalf according to the allocation order and returns the other half to theparent network as free until the block is no larger than the adjustedblock size. Once the block is of the adjusted block size, operationalflow proceeds to block operation 460 where the block is reassigned tothe receiving network and returned from the lend operation 320 to queryoperation 340 of FIG. 3, or from lend operation 440 to split operation450 of FIG. 4 if all levels of lending have not yet completed to returnthe block to the current network.

FIG. 6 shows the logical operations of the next block allocation type asutilized in next block operation 510 of FIG. 5. The logical operationsbegin at filter operation 600 where the address blocks of the networkare filtered to include only blocks that are free and are of therequested size or larger. Then, at range operation 610, if an addressrange has been specified for the allocation request, then only thoseblocks that are free and of at least the requested size that are withinthe specified range are kept.

Once the set of blocks for the network have been filtered to eliminatethose that are not free, are not of sufficient size, and/or are notwithin the specified range, then an attempt is made to choose a blockfrom the set of remaining blocks, if any, at select operation 620. Theblock that is chosen is the highest or lowest numbered address of theremaining blocks in accordance with the network allocation orderspecified for the network in the definitional listing. Once an attemptto select a block is made, then query operation 630 detects whether ablock remained in the set such that it was able to be selected. If not,then a fail is returned by the next block operation 510. If a block wasselected, then the block is returned from the next block operation 510at block operation 640.

FIG. 7 shows the logical operations of the utilization fit allocationtype as performed in utilization fit operation 520 of FIG. 5. Thelogical operations begin at filter operation 700 where the addressblocks of the network are filtered to include only blocks that are freeand are of the requested size or larger. Then, at range operation 710,if an address range has been specified for the allocation request, thenonly those blocks that are free and of at least the requested size thatare within the specified range are kept.

Once the set of blocks for the network have been filtered to eliminatethose that are not free, are not of sufficient size, and/or are notwithin the specified range, then an attempt is made to choose a smallestblock from the set of remaining blocks, if any, at select operation 720.Selecting the smallest block preserves larger blocks for futureallocation needs. The smallest block that is chosen is the highest orlowest numbered address of the remaining blocks of the same smallestsize in accordance with the network allocation order specified for thenetwork in the definitional listing. Once an attempt to select asmallest block is made, then query operation 630 detects whether a blockremained in the set such that it was able to be selected. If not, then afail is returned by the utilization fit operation 520. If a block wasselected, then the block is returned from the utilization fit operation520 at block operation 740.

FIG. 8 shows the logical operations of the rated fit allocation type asutilized in rated fit operation 530 of FIG. 5. Initially, the currentaggregation environment is determined for the current network by setoperation 800 and utilization operation 810. The logical operationsbegin at set operation 800 where the set of child networks of thecurrent network that will aggregate with the current network areobtained from the definitional listing. This is done by looking up theID of the current network in the parent network category of each of thenetworks and also referencing the aggregation category and address typeof each child network to see if it aggregates with the current network.

For each child network that is obtained, the utilization of it and theaggregate descendants of it (i.e., its children and descendents thataggregate with it) is found at utilization operation 810, discussed inmore detail below with reference to FIG. 2A. Also, the set of descendantaggregate blocks for it are obtained, that set being the aggregate ofall blocks belonging to all descendent networks that will aggregate withthe current network, regardless of block status. The aggregate blocksand descendant aggregate blocks are shown in FIG. 2A. Non-aggregatedescendants are not analyzed because they are considered to have adistinct instance of address space and they are not candidates forfuture address transfers. Then, at filter operation 820, the addressblocks of the current network are filtered to include only blocks thatare free and are of the requested size or larger. Also, if an addressrange has been specified for the allocation request, then only thoseblocks that are free and of at least the requested size that are withinthe specified range are kept.

Once the address blocks of the current network have been filtered, queryoperation 830 detects whether at least one block of the current networkexists that meets the filtering criteria. If not, the rated fitoperation 530 returns a fail. If so, then each block for the currentnetwork that passed through the filtering is rated at rate operation 840according to the aggregation environment that is defined by theinformation collected in the previous operations. The details of therate operation are discussed below with reference to FIG. 9. Upon ratingeach block, a block with the highest ranking is selected at selectoperation 850 and is returned as the selected block. Where multipleblocks tie for the highest ranking (i.e., lowest numerical rating), thenthe winning block is selected based on which has the smallest blocksize. If the multiple blocks tying for the highest rating also have thesame size, then the block that is highest or lowest, depending on thenetwork allocation order, is selected.

FIG. 9 shows the logical operations for rating a block. A block ratingis a weighted composite of various measurements of blockcharacteristics. The rating process may be tuned by adjusting theweights, and these weights may be adjusted by parameter inputs. Thelogical operations begin at base rating operation 900 where the baserating for the block is calculated based on block size. This insuresthat the rated fit may be made to optimize for utilization among blocksthat have no additional ratable characteristics (no aggregation or othertested qualities). The base rating may include a standard weight thatdetermines the importance of block size against other characteristics.

After calculating the base rating for a block, query operation 910detects whether the block aggregates with any child descendant aggregateblock. If not, then the rating process is done and the rating given tothe block is based solely on block size. If the block does aggregatewith any child descendant aggregate block, then query operation 920detects whether this current allocation request is a lend request suchas performed at lend operation 320. If not, then the rating for theblock is adjusted for reserve and child utilization at adjustmentoperation 940 and the rating process ends. This adjustment to the ratingeffectively reserves the block for future allocations to thosedescendant networks. The adjustment for child reservation is calculatedby weighting the block size and adding a standard weight. The compositeof two factors allows adjustment to be based on or independent of theblock size. The tendency to reserve blocks is tuned by weighting theamount the ratings are adjusted for these blocks. The rating may befurther adjusted by a weighted measure of the utilization of theaggregate network and its descendants. The utilization adjustment alsoincludes a weighting factor that is multiplied by the block size and theaggregate child utilization, plus a standard amount multiplied by theaggregate child utilization. The two weights allow the adjustment forutilization to be affected by or independent of block size. Multiplyingthe adjustment by utilization also has the effect of more stronglyreserving blocks that will aggregate with children that are more fullyutilized.

For blocks where query operation 920 detects that this is a lendrequest, then query operation 920 detects whether the block aggregateswith the lend destination (i.e. the network that receives the block ofthe lend). If not, then operational flow proceeds to adjustmentoperation 940. If so, then operational flow proceeds to adjustmentoperation 950 which adjusts, based on weighting, the rating for theblock that will aggregate with the child network that will receive theblock through lending, and then the rating ends. The rating adjustmentfor lending includes a component based on block size and a component ofstandard weight, allowing the adjustment to be based on or independentof block size. The rating resulting from such adjustment favors such ablock to improve aggregation in the network.

As an example using the network configuration and address data in FIG.2, allocate a range in the “Manufacturing” network with a block size of/28 (16 addresses). Table 1 below defines the fit parameters that willbe used to rate and select a block in this example. FIG. 2A shows theaggregate block lists and utilizations that are calculated inutilization operation 810 in the rating process. The utilizationpercentages are calculated as the sum of the sizes of non-free blocks inthe network and its aggregate descendants divided by the sum of thesizes of all of the blocks in the network and its aggregate descendantsas shown in FIG. 2A (last column).

There is no address space available in the “Manufacturing” network, so alend request is made to the parent network “Acme.” Block selection from“Acme” is restricted by lending limits 210(/28) and 220(/26) of “Acme,”making blocks 230 192.168.120.144/28) and 240 (192.168.120.208/28) theonly blocks available to satisfy the lend request.

The block factor (BF) is a measurement of the block size expressed asthe number of host bits. Candidate block 230 is a /28 block so the blockfactor is (address size−mask) (32 bits−28)=4. The base rating for theblock is (block size factor *block factor)=6*4=24. In query operation910, it is determined that the block will aggregate with network“Accounting” and the process continues to query operation 920. This is alend request so processing continues to query operation 930.“Accounting” is not the lend destination for the request, so processingcontinues to adjustment operation 940 where the rating is adjusted forreservation. The adjustment for reservation is [(BF*aggregate reservefactor (“ARF”))+aggregate reserve base (“ARB”)]=[(4*−0.5625)+18]=15.75.The adjustment for child utilization is [(BF*aggregate utilizationfactor (“AUF”)* Accounting utilization)+(aggregate utilization base(“AUB”)*Accountingutilization)]=[(4*−0.169921875*0.50)+(5.4375*0.50)]=−0.33984375+2.71875=2.37890625.The total rating is the sum of the base and adjustments(24+15.75+2.37890625)=42.12890625.

Block 240 is the same size as block 230, so it has the same block factorof 4 and the same base rating, 24. It aggregates with Sales, which isnot the lend destination, so the rating is adjusted for reservation andchild utilization in adjustment operation 940. The reserve adjustmentwill be the same value as the previous block. However, the utilizationfor Sales and its descendants is 62.5%, so the child utilizationadjustment is [(BF*AUF*Sales Utilization)+(AUB*SalesUtilization)]=[(4*−0.169921875*0.625)+(5.4375*0.625)]=−0.4248046875+3.3984375=2.9736328125.The total rating is (24+15.75+=2.9736328125=42.7236328125.

The block with the lowest rated value is the preferred block.192.168.120.144/28 is selected. The block is not larger than theadjusted allocation request, so the entire block is transferred to thechild network “Manufacturing.”

If the lend request for a /28 came from Accounting, the rating of block230 would change. Query operation 930 would detect that the blockaggregates with the lend destination and the rating would be adjusted byadjustment operation 950. The lending adjustment would be [(BF*aggregatelend factor (“ALF”))+aggregate lend base (“ALB”)]=[(4*0.4)+−12.8]=(1.6-12.8)=−11.2. The composite value is the base ratingplus the lend adjustment=24+−11.2=12.8. Block 240 would not change itsrating(42.7236328125) and block 230 would be chosen.

If the allocation request for a /28 came from Sales, block 230 wouldhave the original value (42.12890625) and block 240 would be adjustedfor lending at adjustment operation 950 for a final rating of 12.8. Inthis case, block 240 would be chosen. TABLE 1 IPv4 Rated Fit ParametersName Abbreviation Value lock Size Factor BSF 6 Aggregate Lend Factor ALF0.4 Aggregate Lend Base ALB −12.8 Aggregate Reserve Factor ARF −0.5625Aggregate Reserve Base ARB 18 Aggregate Utilization Factor AUF−0.169921875 Aggregate Utilization Base AUB 5.4375

The rated fit parameter values can be changed to adjust the relativeimportance of block size, aggregation with children, child utilization,and lending when selecting a block. The adjustments are used to tune theperformance of the selection process for a balance of addressutilization and aggregation. A screenshot 3200 of FIG. 32 shows a ratedfit parameter table 3202 that the user has selected for viewing. Theuser may manipulate one or more of the parameters for each type ofnetwork of this example by clicking on the edit control 3204 whichallows the user to enter a new parameter value in the table whereappropriate.

The rated fit factors may be implemented as adjustable parameters toallow the user to control and tune the behavior of rated fitallocations. A factor wizard may be provided to assist the user indetermining appropriate values for the factors to produce a predictablebehavior. The user answers a series of questions regarding the choicesthat should be made in specific block comparisons. The factor values arecomputed from the user input. FIG. 32A shows a screenshot 3210 thatprovides one embodiment of a wizard for assisting the user in settingthe rated fit parameter values.

Initially, the user selects in menu 3212 the address type of thenetwork(s) that the rating operations will operate upon using the ratedfit factors, and this value determines bf_(max). The user specifieswhether the difference in bits between a large block that will aggregatewith a requesting child and a smaller block that will not aggregate withany child is constant throughout the entire range of block sizes atselection 3214. Then, at field 3216, the user specifies this differencein bits for the smallest blocks, which is delta_(lend0) (“δ_(lend0)”).At field 3218, if the user selected that the difference in bits is notconstant at selection 3214, then the user specifies the difference inbits for the largest blocks, which is delta_(lend1) (“δ_(lend1)”). Ifthe difference is constant, then the value is equal to δ_(lend0).

At selection 3220, the user specifies whether the difference in bitsbetween a large non-aggregate block and a smaller block that wouldaggregate with a child is constant throughout the entire range of blocksizes. Then, at field 3222, the user specifies this difference in bitsfor the smallest blocks, which is delta_(res0) (“δ_(res0)”). At field3224, if the user selected that the difference in bits is not constantat selection 3220, then the user specifies the difference in bits forthe largest blocks, which is delta_(res1) (“δ_(res1)”). If thedifference is constant, then the value is equal to δ_(res0).

At selection 3226, the user specifies whether child utilization affectsreservation of blocks of the parent. If the user selects that childutilization does affect reservation of the parent blocks, then atselection 3228, the user specifies whether this effect of childutilization is constant throughout the entire range of block sizes. Theuser specifies at field 3230 how much larger the difference in bitsbetween a large non-aggregate block and a smaller block that wouldaggregate with a child is at 100% utilization for the smallest blocks,which is delta_(util0) (“δ_(util0)”). If child utilization has noeffect, then δ_(util0) is equal to zero. Then, the user specifies atfield 3232 how much larger the difference in bits between a largenon-aggregate block and a smaller block that would aggregate with achild is at 100% utilization for the largest blocks, which isdelta_(util1) (“δ_(util1)”). If the difference is constant across theentire address range, then δ_(util1) is equal to δ_(util0).

Upon receiving these inputs from the user through the wizard for FIG.32A, then the factors of Table 1, listed as set 3234 of FIG. 32A may becomputed. These putations follow as equations 1-6. In these equations, ablock size factor (“BSF”) is used. This value may be any positive realnumber. Changing this value scales all of the ratings but results in thesame relative ratings. A value of 1 or bf_(max) are reasonable valuesfor BSF, but any value may be used. Using a negative value of BSF willcause the portion of the rating based on block size to favor largerblocks, therefore increasing fragmentation of the address space. A zerovalue of BSF results in all parameters being zero, which disables therating system completely and resorts to block selection by size and thenaddress order, thereby mimicking the utilization fit. $\begin{matrix}{{ALF} = \frac{{BSF}\left( {\delta_{lend0} - \delta_{lend1}} \right)}{{bf}_{\max} - \delta_{lend0}}} & {{equation}\quad(1)} \\{{ALB} = {{- \left( {{ALF} + {BSF}} \right)} \cdot \delta_{lend0}}} & {{equation}\quad(2)} \\{{ARB} = {{BSF} \cdot \delta_{res0}}} & {{equation}\quad(3)} \\{{ARF} = \frac{{{BSF} \cdot \delta_{res1}} - {ARB}}{{bf}_{\max} - \delta_{res1}}} & {{equation}\quad(4)} \\{{AUB} = {\left( {{BSF} + {ARF}} \right) \cdot \delta_{util0}}} & (5) \\{{AUF} = \frac{{\left( {{BSF} + {ARF}} \right) \cdot \delta_{util}} - {AUB}}{{bf}_{\max} - \delta_{util1}}} & {{equation}\quad(6)}\end{matrix}$

Screenshot 3210 also includes a chart of blocks with varying mask sizes3236 and resulting ratings 3238 for each block size with variation inaggregation and child utilization. Accordingly, a user can verify theratings that result from the answers the user has provided to the wizardand that will be applied during rated fit selection of blocks.

FIG. 23 provides a screenshot 2300 that shows the network settings for anetwork 2302 being adjusted by selecting the architecture button 2304and then the modify button 2308. The result is that a page 2306 of userinput fields are displayed to allow the user to configure the parametersof the network. As shown in screenshot 2400 of FIG. 24, the user mayselect the allocation type drop down menu 2402 to modify the allocationtype and order of the current network. As shown in screenshot 2500 ofFIG. 25, checkbox 2504 allows the user to select whether the networkwill allow lending. If lending is allowed, the user may select thelending minimum drop down menu 2502 to select the minimum size blockthat the network will lend. As shown in screenshot 2600 of FIG. 26, theuser may select the lending maximum drop down menu 2602 to select themaximum size block the network will lend. A logical extension is toconfigure the lending limits of aggregate networks so that descendantnetworks lend smaller blocks than ancestors.

After completing a request for allocating a block of networking addressspace, a user may choose to deallocate a previously allocated block. Forexample, the user may delete all devices from the connection that ablock has been allocated for such that the block can be deallocated andreturned to the free status. Also, the user may explicitly choose todelete an allocated address range that has no devices assigned to it.The screenshot 2700 of FIG. 27 shows an instance where a user has chosena network 2702 and has selected a ranges button 2704 to gain access tothe address ranges for the network. Additionally, the user has selecteda range 2708 of address space and has selected the delete button 2706.This has resulted in a page being displayed that provides the addresses2712 of the range and a button 2710 to complete the deletion of therange. Deleting the range serves to return the range to a free statusfrom its present allocated status.

Upon selecting the button 2710 to complete the deallocation or uponanother deallocation trigger, the logical operations of FIG. 10 fordeallocating the block begin. Initially, query operation 1000 detectswhether the network has a re-use interval by referencing the re-useinterval category for the network within the definitional listing. Ifnot then operational flow proceeds to query operation 1030. If so, thenstatus operation 1010 sets the block status to re-use delay whichindicates that the block is in a pending deallocation status. Then atdelay operation 1020, the deallocation is delayed until the expirationof the re-use interval. The re-use interval may range from no delay tonever allowing re-use. If never allowing re-use, then operational flowends at delay operation 1020 by leaving the block in the re-use delaystatus. Those skilled in the art will recognize there are many methodsand time units for implementing the delay timer.

Once the delay operation 1020 reaches the expiration of the re-useinterval, the operational flow proceeds to query operation 1030 where itis detected whether a reclaim is pending that affects the block beingdeallocated. It is known that a pending reclaim affects the block beingdeallocated because the block being deallocated is identified as havinga pending reclaim in addition to the allocated status by a reclaimprocess that has been initiated. If that is the case, then operationalflow proceeds to reclaim operation 1040, entering at split operation1140. The details of the reclaim operation 1040, including splitoperation 1140, are described in more detail below with reference toFIG. 11. If there is no pending reclaim affecting the block currentlybeing deallocated, then operational flow proceeds to coalesce operation1050 where the deallocated block is coalesced with adjacent free blocksto form the largest possible free block.

The coalesce operation 1050 is repetitive in that the adjacent block tothe deallocated block coalesces with the deallocated block to form alarger block, and then the adjacent block to the larger block coalesceswith the larger block to form an even larger block. This carries onuntil there are no more adjacent free blocks. By coalescing the blocks,it is insured that at any restful state, the free space present in thenetwork is represented as the minimum number of and largest possibleblocks. The resulting block is returned to the network as free.

Upon successfully deallocating a block, such as after pressing thebutton 2710 of FIG. 27 and after expiration of any re-use interval, avisual indication of the deallocated block may be provided. An exampleis shown in the screenshot 2800 of FIG. 28 for a network 2802 where thesummary of the address ranges are displayed. The deallocated addressblock is indicated as having a free status 2804. In this example, noadjacent blocks were free to coalesce with the deallocated block suchthat the deallocated block has retained its size but has the freestatus. Had the deallocated block coalesced with adjacent blocks, thenthe visual indicator may have displayed the larger block after thecoalescing completed as having the free status. As shown in thescreenshot 2900 of FIG. 29, if a re-use interval for the block beingdeallocated for a network 2902 has not yet expired, then the summary ofthe address ranges displays the address block as having a re-useinterval delay status 2904.

A reclaim may be initiated for a block of addresses to collect addressblocks for future disposition. A reclaim reserves free and deallocatedblocks until the larger requested block is available. Reservationprevents allocation, movement, or removal of any block while a pendingreclaim covers that block. Reclaim facilitates renumbering, which isnecessary when merging two networks with conflicting space, returning anaddress block to a service provider or registry, or for networkreorganization. Reclaim may also be used to restore address blocks thathave been moved by other processes such as lending. Reclaim actionsinclude setting to free, deleting, moving to another network, orallocating.

As one example of initiating a reclaim, a user may select that a reclaimbe performed as shown in the screenshot 3000 of FIG. 30. In thisexample, the user has selected a network 3002 and then the architecturebutton 3004. Additionally, the user has selected the address selection3006 to access a page providing options for manipulating the addressspace for a network. In this case, the user has selected a reclaimoption 3008 and has provided a start address and mask size 3010 defininga block to reclaim. The user could have specified the block in otherways as well such as using a netmask or an ending address.

The user then selects the particular type of reclaim to perform from areclaim drop down menu 3012, such as a normal reclamation, a reclaimmove, or a reclaim remove. Upon completion of the reclaim block, anormal reclamation returns the block to the current network as free,while a reclaim move reclaims the address block for the network andmoves it to a destination network specified by the user, and while areclaim remove reclaims the address block and then removes it from thenetwork space altogether leaving the block undefined.

Upon the user selecting the reclaim option, the logical operations ofFIG. 11 begin. Initially, all free blocks in the current network thatare affected by the reclaim block are found at block operation 1100. Thereclaim block may be larger than the individual blocks defined for thecurrent network where the individual blocks are not all free such thatthey have not coalesced into a larger block the size of the reclaimblock. These blocks are marked with the reclaim pending status, whichprevents their use by any other process while the reclaim is inprogress. Also, the reclaim block may fit within a larger defined blockfor the network such that the larger block must be split in half one ormore times to reveal the reclaim block. The portion of the block thathas been split that is not affected by the reclaim is returned to thenetwork as free.

Query operation 1110 detects whether the entire reclaim block is inreclaim pending status. If so, then the requested reclaim action, suchas setting to free, deleting, moving to another network, or allocatingis performed at action operation 1150. If the entire reclaim block isnot in reclaim pending status because some portion of the reclaim blockremains in another status other than free, then operational flowproceeds to monitor operation 1120. Here, the status of the currentnetwork is monitored for trigger events that cause operational flow toproceed to query operation 1130. These events include the definition ofnew blocks, the deallocation of blocks, the completion of a separatereclaim action, or any other activity that results in new free blocks inthe network.

Upon one of these triggering events being detected, query operation 1130detects whether the new or changed block is affected by the pendingreclaim. If not, then operational flow returns to monitor operation1120. If so, then operational flow proceeds to split operation 1140where the new or changed block is split in half as many times asnecessary to reveal the block of the new or changed block that isaffected by the pending reclaim. The block(s) of the new or changedblock not affected by the reclaim remains as free while the block thatis affected by the pending reclaim is marked with the reclaim pendingstatus. Operational flow then returns to query operation 1110.

While the embodiments above are discussed in relation to IPv4 networkingaddressing, it will be appreciated that the discussion in relation toIPv4 is for purposes of illustration only and that these embodiments maybe used in conjunction with networks using ASN, IPv6, or othernetworking addressing schemes. Furthermore, the logical operations forreceiving user input and controlling the status of networking addressspace has been discussed in the context of CIDR format IP address spacefor purposes of illustration only. Therefore, it will be appreciatedthat embodiments of the present invention are operable in the context ofother networking address types as well, such as but not limited totelephone numbers, MAC values, serial numbers, and others.

Although the present invention has been described in connection withvarious illustrative embodiments, those of ordinary skill in the artwill understand that many modifications can be made thereto within thescope of the claims that follow. Accordingly, it is not intended thatthe scope of the invention in any way be limited by the abovedescription, but instead be determined entirely by reference to theclaims that follow.

1. A computer-implemented method of changing a status of a portion ofnetwork address space from free to another status, comprising: receivinga request of a block size to allocate for a current network with a newstatus; detecting within a definitional listing for the network addressspace, a block with free status of sufficient size to cover the blocksize to allocate; and assigning, for the current network, the new statusto the detected block within the definitional listing.
 2. Thecomputer-implemented method of claim 1, wherein determining a block sizeto allocate comprises receiving user input specifying a mask size. 3.The computer-implemented method of claim 1, wherein determining a blocksize to allocate comprises receiving user input specifying a netmask. 4.The computer-implemented method of claim 1, wherein determining a blocksize to allocate comprises receiving a beginning value and an endingvalue.
 5. The computer-implemented method of claim 1, wherein receivingthe request further comprises receiving a fit selection from the groupcomprising: next block fit; utilization fit; and rated fit.
 6. Thecomputer-implemented method of claim 5, wherein when receiving therequest includes receiving a next block fit, then selecting the nextblock of network address space with respect to address order to assign.7. The computer-implemented method of claim 6, wherein selecting thenext block comprises selecting the next block according to a pre-definednetwork allocation order.
 8. The computer-implemented method of claim 5,wherein when receiving the request includes receiving a utilization fit,then selecting a block of the smallest defined block size from anaddress range including blocks of the requested size or larger.
 9. Thecomputer-implemented method of claim 8, further comprising breaking tiesbetween blocks of a same size according to a pre-defined networkallocation order.
 10. The computer-implemented method of claim 5,wherein when receiving the request includes receiving a rated fit, thenrating each block of the current network of at least the requested sizeaccording to a block size and whether there is aggregation with childdescendant aggregate blocks and selecting a block with the best rating.11. The computer-implemented method of claim 10, wherein rating eachblock-comprises utilizing rated fit parameters previously tuned by auser.
 12. The computer-implemented method of claim 1, furthercomprising: detecting whether a block of the requested size existswithin the network address space assigned to the current network; when ablock of the requested size does not exist within the network addressspace assigned to the current network, lending a block from a secondnetwork that aggregates with the current network.
 13. Thecomputer-implemented method of claim 12, wherein receiving the requestfurther comprises receiving a specified range to allocate from, themethod further comprising when a block of the requested size does notexist within the specified range but does exist within the currentnetwork, returning a fail indication and not lending a block fromanother network that aggregates with the current network.
 14. Thecomputer-implemented method of claim 12, wherein lending a block fromanother network comprises: detecting whether a block of at least therequested size exists within a specified range of the network addressspace assigned to the second network; when a block of at least therequested size exists within a specified range of the network addressspace assigned to the second network, splitting the block until it isthe requested size and moving a resulting block from the second networkto the current network as represented within the definitional listing;and when a block of the requested size does not exist within thespecified range, lending a block from a third network that aggregateswith the second network.
 15. The computer-implemented method of claim14, wherein when lending a block from the second network includesreceiving a rated fit selection, the method further comprises: ratingeach block of the second network of at least the requested sizeaccording to a block size and whether there is aggregation with childdescendant aggregate blocks of a requesting or other child network; andselecting a block with the best rating.
 16. The computer-implementedmethod of claim 1, further comprising: detecting whether a block of thedefinitional listing is larger than the requested size; when the blockis larger than the requested size, then splitting the block andselecting a portion resulting from the split according to a predefinednetwork allocation order and repeating until the remaining block is notlarger than the requested size.
 17. A computer-implemented method ofchanging a status of a portion of network address space from a firststatus to a free status, comprising: receiving a request of a block todeallocate for a current network to the free status; and assigning, forthe current network, the free status to the requested block within adefinitional listing for the network address space.
 18. Thecomputer-implemented method of claim 17, wherein assigning the freestatus to the requested block comprises coalescing the requested blocktogether with an adjacent block having free status to create a resultingcombined block with free status.
 19. The computer-implemented method ofclaim 18, further comprising repeating the coalescing of the resultingcombined block with an adjacent block with free status until theadjacent block is not free or not available within the network.
 20. Thecomputer-implemented method of claim 17, further comprising: detectingwhether the current network has a re-use interval; and when the currentnetwork has a re-use interval, delaying until the expiration of there-use interval before assigning the free status to the requested block.21. The computer-implemented method of claim 20, further comprisingsetting the status of the requested block to re-use delay while delayinguntil the expiration of the re-use interval.
 22. Thecomputer-implemented method of claim 17, further comprising: detectingwhether a reclaim of the requested block is pending; and when a reclaimof the requested block is pending, then proceeding with a reclaim of therequested block rather than assigning the free status to the requestedblock.
 23. A computer-implemented method of changing a status of aportion of network address space from a first status to a status of areclaim, comprising: receiving a reclaim action request for a block of acurrent network; detecting whether the entire block to reclaim is in areclaim pending status; and when the entire block to reclaim is in thereclaim pending status, performing the reclaim action upon the entireblock within a definitional listing for the network address space. 24.The computer-implemented method of claim 23, further comprising prior todetecting whether the entire block to reclaim is in a reclaim pendingstatus, marking all blocks having a free status that are within theblock to reclaim with the reclaim pending status.
 25. Thecomputer-implemented method of claim 24, further comprising: upondetecting that the entire block to reclaim is not in a reclaim pendingstatus, monitoring the definitional listing to detect a change to thefree status for one or more blocks within the block to reclaim that arenot in the reclaim pending status; and upon detecting the change to thefree status for one or more of the blocks within the block to reclaimthat are not in a reclaim pending status, assigning the reclaim pendingstatus to the one or more blocks that have changed to the free status.26. The computer-implemented method of claim 25, wherein prior toassigning the reclaim pending status to the one or more blocks that havechanged to the free status, the method further comprising splitting atleast one block containing one or more of the blocks within the block toreclaim and one or more blocks that are not within the block to reclaim.27. A computer system for changing a status of a portion of networkaddress space from free to another status, comprising: storagecontaining a definitional listing for the network address space thatdefines the status of blocks of the network address space; a processorin communication with the storage and being configured to receive arequest of a block size to allocate for a current network with a newstatus, detect within the definitional listing a block with free statusof sufficient size to cover the block size to allocate, and assign, forthe current network, the new status to the detected block within thedefinitional listing.
 28. The computer system of claim 27, wherein theprocessor is further configured to receive a fit selection, andaccording to the fit selection, detect the block with the free statusthat is of sufficient size and assign the new status to the detectedblock.
 29. The computer system of claim 27, wherein the processor isfurther configured to receive a specified range to allocate from, detectwhether a block of the requested size exists within the specified rangeof the network address space assigned to the current network, and when ablock of the requested size does not exist within the specified range,lending a block from a second network that aggregates with the currentnetwork.
 30. A computer system for changing a status of a portion ofnetwork address space from a first status to a free status, comprising:storage containing a definitional listing for the network address spacethat defines the status of blocks of the network address space; and aprocessor in communication with the storage and being configured toreceive a request of a block to deallocate for a current network to thefree status and assign, for the current network, the free status to therequested block within the definitional listing.
 31. The computer systemof claim 30, wherein the processor is configured to assign the freestatus to the requested block and to coalesce the requested blocktogether with an adjacent block having a free status to create aresulting combined block with free status and repeating the coalescingof the resulting combined block with an adjacent block with free statusuntil the adjacent block is not free or not available in the network.32. The computer system of claim 30, wherein the processor is furtherconfigured to detect whether the current network has a re-use interval,delay until the expiration of the re-use interval before assigning thefree status to the requested block when the current network has a re-useinterval, and set the status of the requested block to re-use delaywhile delaying until the expiration of the re-use interval.
 33. Acomputer system for changing a status of a portion of network addressspace from a first status to a status of a reclaim, comprising: storagecontaining a definitional listing for the network address space thatdefines the status of blocks of the network address space; and aprocessor in communication with the storage and being configured toreceive a reclaim action request for a block of a current network,detect whether the entire block to reclaim is in a reclaim pendingstatus, and when the entire block to reclaim is in the reclaim pendingstatus, perform the reclaim action upon the entire block within thedefinitional listing.
 34. The computer system of claim 33, wherein priorto the processor detecting whether the entire block to reclaim is in areclaim pending status, the processor is further configured to mark allblocks having a free status that are within the block to reclaim withthe reclaim pending status.
 35. The computer system of claim 34, whereinthe processor is further configured to, upon detecting that the entireblock to reclaim is not in a reclaim pending status, monitor thedefinitional listing to detect a change to the free status for one ormore blocks within the block to reclaim that are not in the reclaimpending status and upon detecting the change to the free status for oneor more of the blocks within the block to reclaim that are not in areclaim pending status, assign the reclaim pending status to the one ormore blocks that have changed to the free status.
 36. A computerreadable medium containing instructions that when executed by a computerperform steps for changing a status of a portion of network addressspace from free to another status, the steps comprising: receiving arequest of a block size to allocate for a current network with a newstatus; detecting within a definitional listing for the network addressspace, a block with free status of sufficient size to cover the blocksize to allocate; and assigning, for the current network, the new statusto the detected block within the definitional listing.
 37. The computerreadable medium of claim 36, wherein the steps further comprisedetermining a block size to allocate receiving user input from the groupcomprising: a mask size; a netmask; and a beginning value and an endingvalue.
 38. The computer readable medium of claim 36, wherein receivingthe request further comprises receiving a fit selection from the groupcomprising: next block fit; utilization fit; and rated fit.
 39. Thecomputer readable medium of claim 36, wherein the steps furthercomprise: detecting whether a block of the definitional listing islarger than the requested size; when the block is larger than therequested size, then splitting the block and selecting a portionresulting from the split according to a predefined network allocationorder and repeating until the remaining block is not larger than therequested size.
 40. A computer readable medium containing instructionsthat when executed by a computer perform steps for changing a status ofa portion of network address space from a first status to a free status,the steps comprising: receiving a request of a block to deallocate for acurrent network to the free status; and assigning, for the currentnetwork, the free status to the requested block within a definitionallisting for the network address space.
 41. The computer readable mediumof claim 40, wherein the steps further comprise: detecting whether areclaim of the requested block is pending; and when a reclaim of therequested block is pending, then continuing with a reclaim of therequested block rather than assigning the free status to the requestedblock.
 42. A computer readable medium containing instructions that whenexecuted by a computer perform steps for changing a status of a portionof network address space from a first status to a status of a reclaim,the steps comprising: receiving a reclaim action request for a block ofa current network; detecting whether the entire block to reclaim is in areclaim pending status; and when the entire block to reclaim is in thereclaim pending status, performing the reclaim action upon the entireblock within a definitional listing for the network address space. 43.The computer readable medium of claim 42, wherein the steps furthercomprise: prior to detecting whether the entire block to reclaim is in areclaim pending status, marking all blocks having a free status that arewithin the block to reclaim with the reclaim pending status; upondetecting that the entire block to reclaim is not in a reclaim pendingstatus, monitoring the definitional listing to detect a change to thefree status for one or more blocks within the block to reclaim that arenot in the reclaim pending status; upon detecting the change to the freestatus for one or more of the blocks within the block to reclaim thatare not in a reclaim pending status, assigning the reclaim pendingstatus to the one or more blocks that have changed to the free status;and prior to assigning the reclaim pending status to the one or moreblocks that have changed to the free status, splitting at least oneblock containing one or more of the blocks within the block to reclaimand one or more blocks that are not within the block to reclaim.